The Longest Common Subsequence Problem for Arc-Annotated Sequences

The Longest Common Subsequence Problem forArc -

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arc-preserving common subsequence problem has been introduced in 6, 7] as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures and present some new algorithmic and complexit...

Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences

Arc-preserving subsequences of arc-annotated sequences

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures. We consider the longest arc preserving common subsequence proble...

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences

An arc-annotated sequence is a sequence, over a given alphabet, with additional structure described by a possibly empty set of arcs, each arc joining a pair of positions in the sequence. As a natural extension of the longest common subsequence problem, Evans introduced the LONGEST ARC-PRESERVING COMMON SUBSEQUENCE (LAPCS) problem as a framework for studying the similarity of arc-annotated seque...

The c-Fragment Longest Arc-Preserving Common Subsequence Problem

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. In particular, arc-annotated sequences are useful in describing the secondary and tertiary structures of RNA and protein sequences. Structure comparison for RNA and for protein sequences has become a central computational problem bearing many challenging computer science questions. The lo...